Information Theory and Coding - Solved Problems [electronic resource] /
By: Ivaniš, Predrag [author.].
Contributor(s): Drajić, Dušan [author.] | SpringerLink (Online service).
Publisher: Cham : Springer International Publishing : Imprint: Springer, 2017Edition: 1st ed. 2017.Description: VIII, 517 p. 252 illus. | Binding - Card Paper |.Content type: text Media type: computer Carrier type: online resourceISBN: 9783319493701.Subject(s): Computer Engineering
| Communications Engineering, Networks | Coding and Information Theory | Mathematical Applications in Computer ScienceDDC classification: 621.382 Online resources: Click here to access eBook in Springer Nature platform. (Within Campus only.)
In:
Springer Nature eBookSummary: This book is offers a comprehensive overview of information theory and error control coding, using a different approach then in existed literature. The chapters are organized according to the Shannon system model, where one block affects the others. A relatively brief theoretical introduction is provided at the beginning of every chapter, including a few additional examples and explanations, but without any proofs. And a short overview of some aspects of abstract algebra is given at the end of the corresponding chapters. The characteristic complex examples with a lot of illustrations and tables are chosen to provide detailed insights into the nature of the problem. Some limiting cases are presented to illustrate the connections with the theoretical bounds. The numerical values are carefully selected to provide in-depth explanations of the described algorithms. Although the examples in the different chapters can be considered separately, they are mutually connected and the conclusions for one considered problem relate to the others in the book.
This book is offers a comprehensive overview of information theory and error control coding, using a different approach then in existed literature. The chapters are organized according to the Shannon system model, where one block affects the others. A relatively brief theoretical introduction is provided at the beginning of every chapter, including a few additional examples and explanations, but without any proofs. And a short overview of some aspects of abstract algebra is given at the end of the corresponding chapters. The characteristic complex examples with a lot of illustrations and tables are chosen to provide detailed insights into the nature of the problem. Some limiting cases are presented to illustrate the connections with the theoretical bounds. The numerical values are carefully selected to provide in-depth explanations of the described algorithms. Although the examples in the different chapters can be considered separately, they are mutually connected and the conclusions for one considered problem relate to the others in the book.
There are no comments for this item.